全文获取类型
收费全文 | 413篇 |
免费 | 29篇 |
国内免费 | 21篇 |
专业分类
化学 | 16篇 |
力学 | 147篇 |
综合类 | 10篇 |
数学 | 232篇 |
物理学 | 58篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 7篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 14篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 18篇 |
2012年 | 23篇 |
2011年 | 32篇 |
2010年 | 28篇 |
2009年 | 40篇 |
2008年 | 44篇 |
2007年 | 34篇 |
2006年 | 14篇 |
2005年 | 16篇 |
2004年 | 12篇 |
2003年 | 16篇 |
2002年 | 10篇 |
2001年 | 14篇 |
2000年 | 10篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 4篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1976年 | 1篇 |
1957年 | 2篇 |
排序方式: 共有463条查询结果,搜索用时 15 毫秒
1.
2.
Zi‐Niu Wu 《国际流体数值方法杂志》2005,48(5):541-564
The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
3.
Johan Revstedt 《国际流体数值方法杂志》2004,45(7):775-795
The flow around spherical, solid objects is considered. The boundary conditions on the solid boundaries have been applied by replacing the boundary with a surface force distribution on the surface, such that the required boundary conditions are satisfied. The velocity on the boundary is determined by extrapolation from the flow field. The source terms are determined iteratively, as part of the solution. They are then averaged and are smoothed out to nearby computational grid points. A multi‐grid scheme has been used to enhance the computational efficiency of the solution of the force equations. The method has been evaluated for flow around both moving and stationary spherical objects at very low and intermediate Reynolds numbers. The results shows a second order accuracy of the method both at creeping flow and at Re=100. The multi‐grid scheme is shown to enhance the convergence rate up to a factor 10 as compared to single grid approach. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
4.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
5.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
6.
It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003 相似文献
7.
For each infinite cardinal κ, we give examples of 2κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003 相似文献
8.
9.
Robert W. Baddeley Cheryl E. Praeger Csaba Schneider 《Transactions of the American Mathematical Society》2006,358(4):1619-1641
A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in product action. This investigation is carried out by observing that such a wreath product preserves a natural Cartesian decomposition of the underlying set. Previously we classified the possible embeddings in the case where the plinth is simple. Here we extend that classification and identify several different types of Cartesian decompositions that can be preserved by an innately transitive group with a non-abelian plinth. These different types of decompositions lead to different types of embeddings of the acting group into wreath products in product action. We also obtain a full characterisation of embeddings of innately transitive groups with diagonal type into such wreath products.
10.
Let G be a simple graph with adjacency matrix A(G) and (G,x) the permanental polynomial of G. Let G × H denotes the Cartesian product of graphs G and H. Inspired by Kleins idea to compute the permanent of some matrices (Mol. Phy. 31 (3) (1976) 811–823), in this paper in terms of some orientation of graphs we study the permanental polynomial of a type of graphs. Here are some of our main results.1.If G is a bipartite graph containing no subgraph which is an even subdivision of K
2,3, then G has an orientation G
e such that (G,x) = det (xI-A(G
e
)), where A(G
e
) denotes the skew adjacency matrix of G
e.2.Let G be a 2-connected outerplanar bipartite graph with n vertices. Then there exists a 2-connected outerplanar bipartite graph
with 2n+2 vertices such that (G,x) is a factor of
.3.Let T be an arbitrary tree with n vertices. Then
, where
1
,
2
, ...,
n are the eigenvalues of T. 相似文献